Proportionality’s Lower Bound

نویسندگان

چکیده

Abstract Many philosophers have raised difficulties for any attempt to proportion punishment severity crime seriousness. One reason this may be that offering a full theory of proportionality is simply too ambitious. I suggest more modest project: setting lower bound on proportionate punishment. That is, metric measure when not disproportionately severe. claim severe if it imposes costs criminal wrongdoer which are no greater than the they intentionally caused others. flesh out implications Lower by discussing how crime. Methodologically, different should compared considering preferences. Substantively, many judgements undercount focusing only marginal and average cost. we hold defendants causally responsible their contribution type

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Lower Bound on Testing

We introduce a new method of proving lower bounds on the depth of algebraic d-degree decision (resp. computation) trees and apply it to prove a lower bound (log N) (resp. (log N= log log N)) for testing membership to an n-dimensional convex polyhedron having N faces of all dimensions, provided that N > (nd) (n) (resp. N > n (n)). This bound apparently does not follow from the methods developed ...

متن کامل

The Zero Lower Bound

In the standard New Keynesian model, monetary policy is often described by an interest rate rule (e.g. a Taylor rule) that moves the interest rate in response to deviations of inflation and some measure of economic activity from target. Nominal interest rates are bound from below by 0 – since money is storable, one would never accept a negative nominal return. How does the behavior of the NK mo...

متن کامل

A lower bound for ...

Let A and B be two finite subsets of a field F. In this paper we provide a nontrivial lower bound for |{a + b: a ∈ A, b ∈ B, and P (a, b) 6= 0}| where P (x, y) ∈ F[x, y].

متن کامل

A Lower Bound for

It is proved that there is a monotone function in AC(0) 4 which requires exponential size monotone perceptrons of depth 3. This solves the monotone version of a problem which, in the general case, would imply an oracle separation of PPPH.

متن کامل

Smolensky’s Lower Bound

We will be interested in Boolean functions over the Boolean cube {0, 1} and their polynomial approximations. Razborov’s method for approximating an AC0[p] circuit produces a polynomial over Zp (in fact, this generalizes to prime powers); Smolensky’s lower bounds work for any field F. For the rest of the writeup, we will assume all polynomials are over some fixed field F, unless explicitly noted...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Criminal Law and Philosophy

سال: 2021

ISSN: ['1871-9791', '1871-9805']

DOI: https://doi.org/10.1007/s11572-021-09577-6